Characterizing Convergent Terms in Object Calculi via Intersection Types
نویسنده
چکیده
We give a simple characterization of convergent terms in Abadi and Cardelli untyped Object Calculus (ς-calculus) via intersection types. We consider a λ-calculus with records and its intersection type assignment system. We prove that convergent λ-terms are characterized by their types. The characterization is then inherited by the object calculus via self-application interpretation.
منابع مشابه
Intersection Types, -models, and Bb Ohm Trees
This paper is an introduction to intersection type disciplines, with the aim of illustrating their theoretical relevance in the foundations of-calculus. We start by describing the well-known results showing the deep connection between intersection type systems and normalization properties, i.e., their power of naturally characterizing solvable, normalizing, and strongly normalizing pure-terms. ...
متن کاملIntersection Types for Normalization and Verification
One of the basic principles in typed lambda calculi is that typable lambda terms are normalizable. Since the converse direction does not hold for simply typed lambda calculus, people have been studying its extensions. This gave birth to the intersection type systems, that exactly characterize various classes of lambda terms, such as strongly/weakly normalizable terms and solvable ones (see e.g....
متن کاملMultiple Inheritance via Intersection Types
Combining intersection types with higher-order subtyping yields a typed model of object-oriented programming with multiple inheritance. Objects, message passing, subtyping, and inheritance appear as programming idioms in a typed-calculus, a modelling technique that facilitates experimentation and helps in distinguishing between essential aspects of the object-oriented style |encapsulation and s...
متن کاملA General Technique for Analyzing Termination in Symmetric Proof Calculi
Proof-term calculi expressing a computational interpretation of classical logic serve as tools for extracting the constructive content of classical proofs and at the same time can be seen as pure programming languages with explicit representation of control. The inherent symmetry in the underlying logic presents technical challenges to the study of the reduction properties of these systems. We ...
متن کاملCharacterizing Strongly Normalizing Terms of a Calculus with Generalized Applications via Intersection Types
An intersection type assignment system for the extension ΛJ of the untyped λ-calculus, introduced by Joachimski and Matthes, is given and proven to characterize the strongly normalizing terms of ΛJ. Since ΛJ’s generalized applications naturally allow permutative/commuting conversions, this is the first analysis of a term rewrite system with permutative conversions by help of intersection types....
متن کامل